Ingrese una palabra o frase en cualquier idioma 👆
Idioma:
Traducción y análisis de palabras por inteligencia artificial ChatGPT
En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:
- cómo se usa la palabra
- frecuencia de uso
- se utiliza con más frecuencia en el habla oral o escrita
- opciones de traducción
- ejemplos de uso (varias frases con traducción)
- etimología
Qué (quién) es ordered table - definición
Ordered Exponential; Path-ordered exponential
Partially ordered group
GROUP WITH A COMPATIBLE PARTIAL ORDER
Lattice ordered group; Positive element (ordered group); Partially ordered monoid; Orderable group; Ordered group; Lattice-ordered group; Partially-ordered group; Integrally closed ordered group; Integrally closed partially ordered group; Integrally closed (partially ordered group); Positive cone of a partially ordered group
In abstract algebra, a partially ordered group is a group (G, +) equipped with a partial order "≤" that is translation-invariant; in other words, "≤" has the property that, for all a, b, and g in G, if a ≤ b then a + g ≤ b + g and g + a ≤ g + b.
Linearly ordered group
In mathematics, specifically abstract algebra, a linearly ordered or totally ordered group is a group G equipped with a total order "≤" that is translation-invariant. This may have different meanings.
partially ordered set
!['''Fig.2''' [[Commutative diagram]] about the connections between strict/non-strict relations and their duals, via the operations of reflexive closure (''cls''), irreflexive kernel (''ker''), and converse relation (''cnv''). Each relation is depicted by its [[logical matrix]] for the poset whose [[Hasse diagram]] is depicted in the center. For example <math>3 \not\leq 4</math> so row 3, column 4 of the bottom left matrix is empty.](https://commons.wikimedia.org/wiki/Special:FilePath/PartialOrders redundencies svg.svg?width=200 "'''Fig.2''' [[Commutative diagram]] about the connections between strict/non-strict relations and their duals, via the operations of reflexive closure (''cls''), irreflexive kernel (''ker''), and converse relation (''cnv''). Each relation is depicted by its [[logical matrix]] for the poset whose [[Hasse diagram]] is depicted in the center. For example <math>3 \not\leq 4</math> so row 3, column 4 of the bottom left matrix is empty.")
SET ORDERED BY A TRANSITIVE, ANTISYMMETRIC, AND REFLEXIVE BINARY RELATION
PartialOrderedSet; PartialOrder; Partial order; Poset; Partial ordering relation; Partial ordering; Partially ordered; Strict order; Partially ordered sets; Ordered n-tuple; Strict partial ordering; Strict partial order; Poset category; Ordered collection; Non-strict order; Ordered set; Strict ordering; Interval (partial order); Ordinal sum; Partial Order; Partially-ordered set
A set with a partial ordering.
Wikipedia
Ordered exponential
The ordered exponential, also called the path-ordered exponential, is a mathematical operation defined in non-commutative algebras, equivalent to the exponential of the integral in the commutative algebras. In practice the ordered exponential is used in matrix and operator algebras.
